#define _CRT_SECURE_NO_WARNINGS
#include"Tree.h"
#include"Queue.h"

int main()
{
	char arr[] = "ABD##E#H##CF##G##";
	int i = 0;
	BTNode* Tree = BinaryTreeCreate(arr, strlen(arr), &i);
	printf("\n");
	printf("%d ", BinaryTreeSize(Tree));
	printf("%d ", BinaryTreeLeafSize(Tree));
	int k = 3;
	printf("%d ", BinaryTreeLevelKSize(Tree,k));
	printf("%p ", BinaryTreeFind(Tree, 'A'));
	printf("\n");
	BinaryTreeInOrder(Tree);
	printf("\n");
	BinaryTreePostOrder(Tree);
	printf("\n");
	BinaryTreePrevOrder(Tree);
	printf("\n");
	BinaryTreeLevelOrder(Tree);
	printf("\nBinaryTreeComplete :%d", BinaryTreeComplete(Tree));
	BinaryTreeDestory(&Tree);
	return 0;
}